The property suffix tree with dynamic properties
نویسندگان
چکیده
منابع مشابه
The Property Suffix Tree with Dynamic Properties
Recently there has been much interest in the Property Indexing Problem ([1],[7],[8]), where one is interested to preprocess a text T of size n over alphabet Σ (which we assume is of constant size), and a set of intervals π over the text positions, such that give a query pattern P of size m we can report all of the occurrences of P in T which are completely contained within some interval from π....
متن کاملRepresenting the Suffix Tree with the CDAWG
Given a string T , it is known that its suffix tree can be represented using the compact directed acyclic word graph (CDAWG) with eT arcs, taking overall O(eT + eT ) words of space, where T is the reverse of T , and supporting some key operations in time between O(1) and O(log logn) in the worst case. This representation is especially appealing for highly repetitive strings, like collections of...
متن کاملGraph Retrieval with the Suffix Tree Model
The paper in hand presents an adoption of the suffix tree model for the retrieval of labeled graphs. The suffix tree model encodes path information of graphs in an efficient way and so reduces the size of the data structures compared to path index based approaches, while offering a better runtime performance than subgraph isomorphism based methods. Within a specific use case we evaluate the cor...
متن کاملSuffix Tree
SYNONYMS Compact suffix trie DEFINITION The suffix tree S(y) of a non-empty string y of length n is a compact trie representing all the suffixes of the string. The suffix tree of y is defined by the following properties: All branches of S(y) are labeled by all suffixes of y. • • Edges of S(y) are labeled by strings. • Internal nodes of S(y) have at least two children. • Edges outgoing an intern...
متن کاملA Suffix Tree Or Not a Suffix Tree?
In this paper we study the structure of suffix trees. Given an unlabeled tree τ on n nodes and suffix links of its internal nodes, we ask the question “Is τ a suffix tree?”, i.e., is there a string S whose suffix tree has the same topological structure as τ? We place no restrictions on S, in particular we do not require that S ends with a unique symbol. This corresponds to considering the more ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.02.033